Well - Quasi - Orders Christian
نویسنده
چکیده
Based on Isabelle/HOL’s type class for preorders, we introduce a type class for well-quasi-orders (wqo) which is characterized by the absence of “bad” sequences (our proofs are along the lines of the proof of Nash-Williams [1], from which we also borrow terminology). Our main results are instantiations for the product type, the list type, and a type of finite trees, which (almost) directly follow from our proofs of (1) Dickson’s Lemma, (2) Higman’s Lemma, and (3) Kruskal’s Tree Theorem. More concretely: 1. If the sets A and B are wqo then their Cartesian product is wqo. 2. If the set A is wqo then the set of finite lists over A is wqo. 3. If the set A is wqo then the set of finite trees over A is wqo.
منابع مشابه
Recursively Deened Quasi Orders on Terms
We study the problems involved in the recursive de nition of (quasi) orders on terms, focussing on the question of establishing well-de nedness, and the properties required for partial and quasi-orders: irre exivity and transitivity, and re exivity and transitivity, respectively. These properties are in general di cult to establish and this has in many cases come down in the literature as folkl...
متن کاملRegular tree languages and quasi orders
Regular languages were characterized as sets closed with respect to monotone well-quasi orders. A similar result is proved here for tree languages. Moreover, families of quasi orders that correspond to positive varieties of tree languages and varieties of finite ordered algebras are characterized.
متن کاملComplete Analytic Equivalence Relations
We prove that various concrete analytic equivalence relations arising in model theory or analysis are complete, i.e. maximum in the Borel reducibility ordering. The proofs use some general results concerning the wider class of analytic quasi-orders.
متن کاملThe complexity of continuous embeddability between dendrites
We show that the quasi-order of continuous embeddability between finitely branching dendrites (a natural class of fairly simple compacta) is Σ1-complete. We also show that embeddability between countable linear orders with infinitely many colors is Σ1-complete.
متن کاملWell-Quasi-Orders
Based on Isabelle/HOL’s type class for preorders, we introduce a type class for well-quasi-orders (wqo) which is characterized by the absence of “bad” sequences (our proofs are along the lines of the proof of Nash-Williams [1], from which we also borrow terminology). Our main results are instantiations for the product type, the list type, and a type of finite trees, which (almost) directly foll...
متن کامل